Akl(fd) { a Concurrent Language for Fd Programming Akl(fd) { a Concurrent Language for Fd Programming
نویسندگان
چکیده
We consider a complete implementation of an extension of the nite domain constraint system FD, including antimonotone constraints, and its integration in AKL, a deep-guard concurrent constraint language. We present the language AKL(FD), together with associated programming techniques. In particular, we show how powerful symbolic constraints can be deened as AKL(FD) programs, which is partly made possible by the extension of FD with a condition combinator and a proper treatment of antimonotone constraints. The AGENTS implementation of AKL(FD) shows competetive performance in a complete programming environment. Abstract We consider a complete implementation of an extension of the nite domain constraint system FD, including antimonotone constraints, and its integration in AKL, a deep-guard concurrent constraint language. We present the language AKL(FD), together with associated programming techniques. In particular, we show how powerful symbolic constraints can be deened as AKL(FD) programs, which is partly made possible by the extension of FD with a condition combinator and a proper treatment of antimonotone constraints. The AGENTS implementation of AKL(FD) shows competetive performance in a complete programming environment.
منابع مشابه
The implementation of AKL(FD)
AKL(FD) is an integration of (an extension of) the nite domain constraint system FD in AKL, a deep concurrent constraint programming language [CJH94]. In this paper we describe the implementation of the FD solver and its adaptation to the generic constraint interface of the AGENTS implementation of AKL. We also describe compilation techniques used by the AKL(FD) compiler.
متن کاملAKL(FD) - A Concurrent Language for FD Programming
We consider a complete implementation of an extension of the nite domain constraint system FD, including antimonotone constraints, and its integration in AKL, a deep-guard concurrent constraint language. We present the language AKL(FD), together with associated programming techniques. In particular, we show how powerful symbolic constraints can be de ned as AKL(FD) programs, which is partly mad...
متن کاملThe implementation of AKL ( FD ) Bj
AKL(FD) is an integration of (an extension of) the nite domain constraint system FD in AKL, a deep concurrent constraint programming language CJH94]. In this paper we describe the implementation of the FD solver and its adaptation to the generic constraint interface of the AGENTS implementation of AKL. We also describe compilation techniques used by the AKL(FD) compiler. 1 Introduction Conceptu...
متن کاملBoolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a single primitive constraint which allows the boolean solver to be encoded at a low-level. The boolean solver obtained in this way is both very simple and very efficient: on average it is eight times faster than the CHIP pro...
متن کاملOptimal Incremental and Anytime Scheduling
We discuss the use of constraint programming for a class of reactive applications that concurrently monitor and control their environment. Programs dealing with such problems have to be incremental and anytime, in the sense that sensor information is accumulated incrementally and control decisions have to be made on request while the program is running. We present as a real-life example the sch...
متن کامل